A multivariate cryptosystem inspired by random linear codes
نویسندگان
چکیده
منابع مشابه
On two windows multivariate cryptosystem depending on random parameters
The concept of multivariate bijective map of an affine space K over commutative Ring K was already used in Cryptography. We consider the idea of nonbijective multivariate polynomial map Fn of K n into K represented as ”partially invertible decomposition” F (1) n F (2) n . . . F (k) n , k = k(n), such that knowledge on the decomposition and given value u = F (v) allow to restore a special part v...
متن کاملlinear codes on solid bursts and random errors
the paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length $b$ or less and simultaneously any $e$ or less random errors. an example of such a code is also provided. further, codes capable of detecting and simultaneously correcting such errors have also been dealt with.
متن کاملRandom Generation of Linear Codes
Isometry classes of linear codes can be expressed as orbits under the group action of a wreath product. Some combinatorial and algebraic methods are discussed which can be applied for generating linear codes distributed uniformly at random over all isometry classes.
متن کاملDecoding Algorithms for Random Linear Network Codes
We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially achieve a high coding throughput, and reduce energy consumption. We use an on-the-fly version of the ...
متن کاملLinear Locally Repairable Codes with Random Matrices
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this gives also a constructive method to find...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2021
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2020.101778